cvc5: A Versatile and Industrial-Strength SMT Solver
نویسندگان
چکیده
Abstract cvc5 is the latest SMT solver in cooperating validity checker series and builds on successful code base of CVC4. This paper serves as a comprehensive system description ’s architectural design highlights major features components introduced since CVC4 1.8. We evaluate performance all benchmarks SMT-LIB provide comparison against Z3.
منابع مشابه
The MathSAT5 SMT Solver
MATHSAT is a long-term project, which has been jointly carried on by FBK-IRST and University of Trento, with the aim of developing and maintaining a state-of-the-art SMT tool for formal verification (and other applications). MATHSAT5 is the latest version of the tool. It supports most of the SMT-LIB theories and their combinations, and provides many functionalities (like e.g. unsat cores, inter...
متن کاملThe YICES SMT Solver
SMT stands for Satisfiability Modulo Theories. An SMT solver decides the satisfiability of propositionally complex formulas in theories such as arithmetic and uninterpreted functions with equality. SMT solving has numerous applications in automated theorem proving, in hardware and software verification, and in scheduling and planning problems. This paper describes Yices, an efficient SMT solver...
متن کاملA Lazy and Layered SMT(BV ) Solver for Hard Industrial Verification Problems
Rarely verification problems originate from bit-level descriptions. Yet, most of the verification technologies are based on bit blasting, i.e., reduction to boolean reasoning. In this paper we advocate reasoning at higher level of abstraction, within the theory of bit vectors (BV ), where structural information (e.g. equalities, arithmetic functions) is not blasted into bits. Our approach relie...
متن کاملA branching heuristic in CVC4 SMT Solver
This article summarizes work done with Clark Barrett on branching heuristics in CVC4. In particular, it explores an approach to use a nonclausal solver in conjunction with the clausal solver in an SMT solver. It is intended to document and explain an algorithm implemented in CVC4. Introduction. At the heart of an SMT solver is a SAT solver which works with the Boolean structure of the formula. ...
متن کاملνZ - An Optimizing SMT Solver
νZ is a part of the SMT solver Z3. It allows users to pose and solve optimization problems modulo theories. Many SMT applications use models to provide satisfying assignments, and a growing number of these build on top of Z3 to get optimal assignments with respect to objective functions. νZ provides a portfolio of approaches for solving linear optimization problems over SMT formulas, MaxSMT, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-99524-9_24